A Genetic Algorithm for Solving General System of Equations
نویسندگان
چکیده
For solving linear system of equations is known several algorithms. Iteration algorithms are recommended for the large linear systems with sparse matrix. But in the case of general n x m matrices the classic iterative algorithms are not applicable with a few exceptions. For example in some cases the Lanczos type algorithms are adequate. The algorithm presented here based on the minimization of residuum of solution and it has some genetic character. Therefore this algorithm seems to be applicable for construction of parallel algorithm. Here we describe a sequential version of proposed algorithm and give its theoretical analysis. Moreover we show some numerical test results of the sequential algorithm.
منابع مشابه
An Efficient Numerical Algorithm For Solving Linear Differential Equations of Arbitrary Order And Coefficients
Referring to one of the recent works of the authors, presented in~cite{differentialbpf}, for numerical solution of linear differential equations, an alternative scheme is proposed in this article to considerably improve the accuracy and efficiency. For this purpose, triangular functions as a set of orthogonal functions are used. By using a special representation of the vector forms of triangula...
متن کاملConvergence of the multistage variational iteration method for solving a general system of ordinary differential equations
In this paper, the multistage variational iteration method is implemented to solve a general form of the system of first-order differential equations. The convergence of the proposed method is given. To illustrate the proposed method, it is applied to a model for HIV infection of CD4+ T cells and the numerical results are compared with those of a recently proposed method.
متن کاملOptimization of Meshless Local Petrov-Galerkin Parameters using Genetic Algorithm for 3D Elasto-static Problems (TECHNICAL NOTE)
A truly Meshless Local Petrov-Galerkin (MLPG) method is developed for solving 3D elasto-static problems. Using the general MLPG concept, this method is derived through the local weak forms of the equilibrium equations, by using a test function, namely, the Heaviside step function. The Moving Least Squares (MLS) are chosen to construct the shape functions. The penalty approach is used to impose ...
متن کاملJacobi Operational Matrix Approach for Solving Systems of Linear and Nonlinear Integro-Differential Equations
This paper aims to construct a general formulation for the shifted Jacobi operational matrices of integration and product. The main aim is to generalize the Jacobi integral and product operational matrices to the solving system of Fredholm and Volterra integro--differential equations which appear in various fields of science such as physics and engineering. The Operational matr...
متن کاملSolving Redundancy Allocation Problem with Repairable Components Using Genetic Algorithm and Simulation Method
Reliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal com...
متن کاملGlobal conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005